Computer aided process planning for multi-axis CNC machining using feature free polygonal CAD models

This dissertation provides new methods for the general area of Computer Aided Process Planning, often referred to as CAPP. It specifically focuses on 3 challenging problems in the area of multi-axis CNC machining process using feature free polygonal CAD models. The first research problem involves a new method for the rapid machining of Multi-Surface Parts. These types of parts typically have different requirements for each surface, for example, surface finish, accuracy, or functionality. The CAPP algorithms developed for this problem ensure the complete rapid machining of multi surface parts by providing better setup orientations to machine each surface. The second research problem is related to a new method for discrete multi-axis CNC machining of part models using feature free polygonal CAD models. This problem specifically considers a generic 3-axis CNC machining process for which CAPP algorithms are developed. These algorithms allow the rapid machining of a wide variety of parts with higher geometric accuracy by enabling access to visible surfaces through the choice of appropriate machine tool configurations (i.e. number of axes). The third research problem addresses challenges with geometric singularities that can occur when 2D slice models are used in process planning. The conversion from CAD to slice model results in the loss of model surface information, the consequence of which could be suboptimal or incorrect process planning. The algorithms developed here facilitate transfer of complete surface geometry information from CAD to slice models. The work of this dissertation will aid in developing the next generation of CAPP tools and result in lower cost and more accurately machined components

Process planning for the rapid machining of custom bone implants

This thesis proposes a new process planning methodology for rapid machining of bone implants with customized surface characteristics. Bone implants are used in patients to replace voids in the fractured bones created during accident or trauma. Use of bone implants allow better fracture healing in the patients and restore the original bone strength. The manufacturing process used for creating bone implants in this thesis is highly automated CNC-RP invented at Rapid Manufacturing and Prototyping Lab (RMPL) at Iowa State University. CNC-RP is a 4th axis rapid machining process where the part is machined using cylindrical stock fixed between two opposing chucks. In addition to conventional 3 axes, the chucks provide 4th rotary axis that allows automated fixturing setups for machining the part. The process planning steps for CNC-RP therefore includes calculating minimum number of setup orientations required to create the part about the rotary axis. The algorithms developed in this thesis work towards calculating a minimum number of orientations required to create bone implant with their respective surface characteristics. Usually bone implants may have up to 3 types of surfaces (articular/periosteal/fractured) with (high/medium/low) finish. Currently CNC-RP is capable of creating accurate bone implants from different clinically relevant materials with same surface finish on all of the implant surfaces. However in order to enhance the functionality of the bone implants in the biological environment, it is usually advisable to create implant surfaces with their respective characteristics. This can be achieved by using setup orientations that would generally isolate implant surfaces and machine them with individual finishes. This thesis therefore focuses on developing process planning algorithms for calculating minimum number of orientations required to create customized implant surfaces and control related issues. The bone implants created using new customization algorithms would have enhanced functionality. This would reduce the fracture healing time for the patient and restore the original bone strength. The software package created using new algorithms will be termed as CNC-RPbio throughout in this thesis The three main tasks in this thesis are a) calculating setup orientations in a specific sequence for implant surfaces b) Algorithms for calculating a minimum number of setup orientations to create implant surfaces c) Machining operation sequence. These three research tasks are explained in details in chapter 4 of this thesis. The layout of this thesis is as follows. Chapter 1 provides introduction, background and motivation to the research in this thesis. Chapter 2 provides a literature review explaining different researches conducted to study the effects of different surface finish on the bone implants on their functionality. It also presents different non-traditional and RP techniques used to create bone implant geometries with customized surfaces, their advantages and limitations. Chapter 3 gives the overview of process planning algorithms used for CNC-RP and those needed for CNC-RPbio. Chapter 4 is the main chapter of the thesis including process planning algorithms for rapid machining of bone implants with customized surfaces using CNC-RP in details, while Chapter 5 provides Conclusions and Future work

Optimasi Portofolio Resiko Menggunakan Model Markowitz MVO Dikaitkan dengan Keterbatasan Manusia dalam Memprediksi Masa Depan dalam Perspektif Al-Qur`an

Risk portfolio on modern finance has become increasingly technical, requiring the use of sophisticated mathematical tools in both research and practice. Since companies cannot insure themselves completely against risk, as human incompetence in predicting the future precisely that written in Al-Quran surah Luqman verse 34, they have to manage it to yield an optimal portfolio. The objective here is to minimize the variance among all portfolios, or alternatively, to maximize expected return among all portfolios that has at least a certain expected return. Furthermore, this study focuses on optimizing risk portfolio so called Markowitz MVO (Mean-Variance Optimization). Some theoretical frameworks for analysis are arithmetic mean, geometric mean, variance, covariance, linear programming, and quadratic programming. Moreover, finding a minimum variance portfolio produces a convex quadratic programming, that is minimizing the objective function ðð¥with constraintsð ð 𥠥 ðandð´ð¥ = ð. The outcome of this research is the solution of optimal risk portofolio in some investments that could be finished smoothly using MATLAB R2007b software together with its graphic analysis

Search for heavy resonances decaying to two Higgs bosons in final states containing four b quarks

A search is presented for narrow heavy resonances X decaying into pairs of Higgs bosons (H) in proton-proton collisions collected by the CMS experiment at the LHC at root s = 8 TeV. The data correspond to an integrated luminosity of 19.7 fb(-1). The search considers HH resonances with masses between 1 and 3 TeV, having final states of two b quark pairs. Each Higgs boson is produced with large momentum, and the hadronization products of the pair of b quarks can usually be reconstructed as single large jets. The background from multijet and t (t) over bar events is significantly reduced by applying requirements related to the flavor of the jet, its mass, and its substructure. The signal would be identified as a peak on top of the dijet invariant mass spectrum of the remaining background events. No evidence is observed for such a signal. Upper limits obtained at 95 confidence level for the product of the production cross section and branching fraction sigma(gg -> X) B(X -> HH -> b (b) over barb (b) over bar) range from 10 to 1.5 fb for the mass of X from 1.15 to 2.0 TeV, significantly extending previous searches. For a warped extra dimension theory with amass scale Lambda(R) = 1 TeV, the data exclude radion scalar masses between 1.15 and 1.55 TeV

Measurement of the top quark mass using charged particles in pp collisions at root s=8 TeV

Peer reviewe

Search for supersymmetry in events with one lepton and multiple jets in proton-proton collisions at root s=13 TeV

Peer reviewe

Inclusive search for supersymmetry using razor variables in pp collisions at root s=13 TeV

Peer reviewe